منابع مشابه
Time heals all wounds—but 12-HHT is faster
1008 INSIGHTS | The Journal of Experimental Medicine Chronic nonhealing wounds such as diabetic ulcers are a major problem associated with human disease. In this issue, Liu et al. offer new hope for tackling nonhealing wounds by defining a novel role for the leukotriene B 4 receptor type 2 (BLT2) and its ligand 12-hydroxyheptadecatrienoic acid (12-HHT) in wound healing. They also show that high...
متن کاملFaster than Nyquist but Slower than
This paper presents a significant modification to the Random Demodulator (RD) of Tropp et al. for sub-Nyquist sampling of frequency-sparse signals. The modification, termed constrained random demodulator, involves replacing the random waveform integral to the operation of the RD with a constrained random waveform that has limits on its switching rate because fast switching waveforms may be hard...
متن کاملFaster than Hermitian Time Evolution
For any pair of quantum states, an initial state |I〉 and a final quantum state |F 〉, in a Hilbert space, there are many Hamiltonians H under which |I〉 evolves into |F 〉. Let us impose the constraint that the difference between the largest and smallest eigenvalues of H, Emax and Emin, is held fixed. We can then determine the Hamiltonian H that satisfies this constraint and achieves the transform...
متن کاملSelenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time
The Hanoï Tower problem is a classic exercise in recursive programming: the solution has a simple recursive definition, and its complexity and the matching lower bound correspond to the solution of a simple recursive function (the solution is so simple that most students memorize it and regurgitate it at exams without truly understanding it). We describe how some minor change in the rules of th...
متن کاملBouncing Towers move faster than Hanoi Towers, but still require exponential time
The problem of the Hanoï Tower is a classic exercise in recursive programming: the solution has a simple recursive definition, and its complexity and the matching lower bound are the solution of a simple recursive function (the solution is so easy that most students memorize it and regurgitate it at exams without truly understanding it). We describe how some very minor changes in the rules of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2016
ISSN: 1542-7730,1542-7749
DOI: 10.1145/3028687.3036398